A linear algorithm for Brick Wang tiling

نویسندگان

  • Alexandre Derouet-Jourdan
  • Shizuo Kaji
  • Yoshihiro Mizoguchi
چکیده

In computer graphics, Wang tiles are used as a tool to generate non periodic textures and patterns. We develop a framework and a method for the tiling problem which is suitable for applications. In particular, we apply our methodology to a special kind of Wang tiles, called Brick Wang tiles, introduced by Derouet-Jourdan et al. in 2015 to model wall patterns. We generalise their result by providing a linear algorithm to decide and solve the tiling problem for arbitrary planar regions with holes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degree Reduction of Disk Wang-Bézier Type Generalized Ball Curves

A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...

متن کامل

Degree Reduction of Disk Wang-Bézier Type Generalized Ball Curves

A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...

متن کامل

Tiling a Rectangle with Polyominoes

A polycube in dimension d is a finite union of unit d-cubes whose vertices are on knots of the lattice Zd . We show that, for each family of polycubes E, there exists a finite set F of bricks (parallelepiped rectangles) such that the bricks which can be tiled by E are exactly the bricks which can be tiled by F . Consequently, if we know the set F , then we have an algorithm to decide in polynom...

متن کامل

A Comparison of Compiler Tiling Algorithms

Linear algebra codes contain data locality which can be exploited by tiling multiple loop nests. Several approaches to tiling have been suggested for avoiding connict misses in low associativity caches. We propose a new technique based on intra-variable padding and compare its performance with existing techniques. Results show padding improves performance of matrix multiply by over 100% in some...

متن کامل

99 9 Signed Shape Tilings of Squares ∗

Let T be a tile made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be tilable by finitely many Qweighted tiles with the same shape as T , and necessary and sufficient conditions for a square to be tilable by finitely many Z-weighted tiles with the sa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1603.04292  شماره 

صفحات  -

تاریخ انتشار 2016